Partition of Graphs and Hypergraphs into Monochromatic Connected Parts
نویسندگان
چکیده
We show that two results on covering of edge colored graphs by monochromatic connected parts can be extended to partitioning. We prove that for any 2-edgecolored non-trivial r-uniform hypergraph H, the vertex set can be partitioned into at most α(H)− r+ 2 monochromatic connected parts, where α(H) is the maximum size of a set of vertices that does not contain any edge. In particular, any 2-edgecolored graph G can be partitioned into α(G) monochromatic connected parts, where α(G) denotes the independence number of G. This extends König’s theorem, a special case of Ryser’s conjecture. Our second result is about Gallai-colorings, i.e. edge-colorings of graphs without 3-edge-colored triangles. We show that for any Gallai-coloring of a graph G, the vertex set of G can be partitioned into monochromatic connected parts, where the number of parts depends only on α(G). This extends its cover-version proved earlier by Simonyi and two of the authors.
منابع مشابه
Monochromatic Path and Cycle Partitions in Hypergraphs
Here we address the problem to partition edge colored hypergraphs by monochromatic paths and cycles generalizing a well-known similar problem for graphs. We show that r-colored r-uniform complete hypergraphs can be partitioned into monochromatic Berge-paths of distinct colors. Also, apart from 2k − 5 vertices, 2-colored k-uniform hypergraphs can be partitioned into two monochromatic loose paths...
متن کاملMonochromatic Loose-cycle Partitions in Hypergraphs
In this paper we study the monochromatic loose-cycle partition problem for non-complete hypergraphs. Our main result is that in any r-coloring of a k-uniform hypergraph with independence number α there is a partition of the vertex set into monochromatic loose cycles such that their number depends only on r, k and α. We also give an extension of the following result of Pósa to hypergraphs: the v...
متن کاملMonochromatic Structures in Edge-coloured Graphs and Hypergraphs - A survey
Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of a certain type, such as a connected subgraph, or a cycle, or some type of tree? Also, how many such monochromatic subgraphs do we need so that their vertex sets form either a partition or a covering of the vertices of the original graph? What happens for the analogous situations for hypergraphs?...
متن کاملCATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کاملMonochromatic Kr-Decompositions of Graphs
Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any k-edge-coloured graph G of order n, admits a monochromatic H-decomposition with at most φ parts. Here we stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 19 شماره
صفحات -
تاریخ انتشار 2012